منابع مشابه
Parsing Intentions of Speech
This paper is aimed at revealing the inner structures of intentions of speech through demonstrating a method of parsing intentions of speech. The intentions of speech are parsed separately, which is inspired by Searle’s notation ( ) . In this research, both the propositional content and the illocutionary forces are represented as semantic frames, the categories of which are combined together wi...
متن کاملParsing transcripts of speech
We present an analysis of parser performance on speech data, comparing word type and token frequency distributions with written data, and evaluating parse accuracy by length of input string. We find that parser performance tends to deteriorate with increasing length of string, more so for spoken than for written texts. We train an alternative parsing model with added speech data and demonstrate...
متن کاملParsing spontaneous speech
In this paper we will present work carried out lately on the 50,000 words Italian Spontaneous Speech Corpus called AVIP, under national project API, made available for free download from the website of the coordinator, the University of Naples. We will concentrate on the tuning of the parser for Italian which had been previously used to parse 100,000 words corpus of written Italian within the N...
متن کاملLinguistic Resources for Speech Parsing
We report on the success of a two-pass approach to annotating metadata, speech effects and syntactic structure in English conversational speech: separately annotating transcribed speech for structural metadata, or structural events, (fillers, speech repairs ( or edit dysfluencies) and SUs, or syntactic/semantic units) and for syntactic structure (treebanking constituent structure and shallow ar...
متن کاملAnytime Algorithms for Speech Parsing?
This paper discusses to which extent the concept of anytime algorithms can be applied to parsing algorithms with feature uni cation We rst try to give a more precise de nition of what an anytime algorithm is We argue that parsing algorithms have to be classi ed as contract algorithms as opposed to truly interruptible algorithms With the restriction that the transaction being active at the time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research in Computing Science
سال: 2013
ISSN: 1870-4069
DOI: 10.13053/rcs-70-1-9